#pragma once
#include<iostream>
#include"HashTable.h"
namespace bit
{

	

	template<class V>
	class unordered_set
	{
	public:
		class KOFSet
		{
		public:
			const V& operator()(const V& key)
			{
				return key;
			}
		};
	public:
		typedef typename HashTable<V, V, KOFSet> Table;
		typedef typename bit::HashTable<V,V,KOFSet>::const_iterator iterator;
		typedef typename iterator const_iterator;
		std::pair<iterator,bool>insert(const V& value)
		{
			return  _table.insert(value);
		}

		const_iterator find(const V& value)const
		{
			return _table.find(value);
		}

		bool delet(const V& key)
		{
			return _table.delet(key);
		}

		const_iterator begin()const
		{
			return _table.begin();
		}
		const_iterator end()const
		{
			
			return _table.end();
		}

		
		
	public:
		Table _table;
	};
}
